Communication Steps for Parallel Query Processing
نویسندگان
چکیده
منابع مشابه
Communication Cost in Parallel Query Processing
We study the problem of computing conjunctive queries over large databases on parallelarchitectures without shared storage. Using the structure of such a query q and the skew in thedata, we study tradeoffs between the number of processors, the number of rounds of commu-nication, and the per-processor load – the number of bits each processor can send or can receivein a single rou...
متن کاملParallel Query Processing
With relations growing larger and queries becoming more complex, parallel query processing is an increasingly attractive option for improving the performance of database systems. The objective of this paper is to examine the various issues encountered in parallel query processing and the techniques available for addressing these issues. The focus of the paper is on the join operation with both ...
متن کاملA Communication-oriented Approach to Parallel Relational Query Optimization and Processing Ecole Normale Supérieure De Lyon a Communication-oriented Approach to Parallel Relational Query Optimization and Processing
This report presents a compile-time optimization methodology for complex relational query processing on a multiprocessor machine. A new scheduling algorithm is proposed to allocate the resources of the machine. Furthermore the management of intra-processors communication and load balancing is explicitly introduced into the parallelization strategy. A new control mechanism is presented in order ...
متن کاملParallel Algorithms for Top-k Query Processing
The general problem of answering top-k queries can be modeled using lists of objects sorted by their local scores. Fagin et al. proposed the “middleware cost” for a top-k query algorithm, and proposed the efficient sequential Threshold Algorithm (TA). However, since the size of the dataset can be incredible huge, the middleware cost of sequential TA may be intolerable. So, in this paper, we pro...
متن کاملParallel Query Processing in DBS3
In this paper, we describe our approach to the compile-time optimization and parallelization of queries for execution in DBS3, a shared-memory parallel database system. Our approach enables exploring a search space large enough to include zigzag trees which are intermediate between left-deep and right-deep trees. Zigzag trees are shown to provide better response time than right-deep trees in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2017
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3125644